Enhanced Harmony Search Algorithm for Nurse Rostering Problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A harmony search algorithm for nurse rostering problems

Harmony Search Algorithm (HSA) is a relatively new nature-inspired algorithm. It evolves solutions in the problem search space by mimicking the musical improvisation process in seeking agreeable harmony measured by aesthetic standards. The Nurse Rostering Problem (NRP) is a well-known NP-hard scheduling problem that aims at allocating the required workload to the available staff nurses at healt...

متن کامل

Harmony Search with Greedy Shuffle for Nurse Rostering

In this paper, a hybridization of Harmony Search Algorithm (HSA) with a greedy shuffle move is proposed for Nurse Rostering Problem (NRP). NRP is a combinatorial optimization problem that is tackled by assigning a set of nurses with different skills and contracts to different types of shifts, over a pre-determined scheduling period. HSA is a population-based method which mimics the improvisatio...

متن کامل

Variable Neighbourhood Search for Nurse Rostering Problems

Nurse rostering problems consist of assigning varying tasks, represented as shift types, to hospital personnel with different skills and work regulations. We want to satisfy as many constraints and personal preferences as possible while constructing a schedule which meets the personnel requirements of the hospital over a predefined planning period. Real world situations are often so constrained...

متن کامل

A variable neighborhood search based matheuristic for nurse rostering problems

A practical nurse rostering problem, which arises at a ward of an Italian private hospital, is considered. In this problem, it is required each month to generate the nursing staff shifts subject to various requirements. A matheuristic approach is introduced, based on a set of neighborhoods searched by a commercial integer programming solver within a defined global time limit. Generally speaking...

متن کامل

A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem

This paper deals with the problem of nurse rostering in Belgian hospitals. This is a highly constrained real world problem that was (until the results of this research were applied) tackled manually. The problem basically concerns the assignment of duties to a set of people with different qualifications, work regulations and preferences. Constraint programming and linear programming techniques ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Sciences

سال: 2013

ISSN: 1812-5654

DOI: 10.3923/jas.2013.846.853